Semi-supervised Sparsity Pairwise Constraint Preserving Projections based on GA

نویسندگان

  • Mingming Qi
  • Yang Xiang
چکیده

The deficiency of the ability for preserving global geometric structure information of data is the main problem of existing semi-supervised dimensionality reduction with pairwise constraints. A dimensionality reduction algorithm called Semi-supervised Sparsity Pairwise Constraint Preserving Projections based on Genetic Algorithm (SSPCPPGA) is proposed. On the one hand, the algorithm fuses unsupervised sparse reconstruction feature information and supervised pairwise constraint feature information in the process of dimensionality reduction, preserving geometric structure in samples and constraint relation of samples simultaneously. On the other hand , the algorithm introduces the genetic algorithm to set automatically the weighted trade-off parameter for full fusion. Experiments operated on real world datasets show, in contrast to the existing typical semi-supervised dimensionality reduction algorithms with pairwise constraints and other semi-supervised dimensionality reduction algorithms on sparse representation, the proposed algorithm is more efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-based sparsity preserving projections and its application on face recognition

Aiming at the deficiency of supervise information in the process of sparse reconstruction in Sparsity Preserving Projections (SPP), a semi-supervised dimensionality reduction method named Constraint-based Sparsity Preserving Projections (CSPP) is proposed. CSPP attempts to make use of supervision information of must-link constraints and cannot-link constraints to adjust the sparse reconstructiv...

متن کامل

Constraint Sparse Neighborhood Preserving Embedding

Neighborhood Preserving Embedding (NPE) and extensions of NPE are hot research topics of data mining at present. An algorithm called Constraint Sparse Neighborhood Preserving Embedding (CSNPE) for dimensionality reduction is proposed in the paper. The algorithm firstly creates the local sparse reconstructive relation information of samples; then, exacts the pairwise constrain information of sam...

متن کامل

Wised Semi-Supervised Cluster Ensemble Selection: A New Framework for Selecting and Combing Multiple Partitions Based on Prior knowledge

The Wisdom of Crowds, an innovative theory described in social science, claims that the aggregate decisions made by a group will often be better than those of its individual members if the four fundamental criteria of this theory are satisfied. This theory used for in clustering problems. Previous researches showed that this theory can significantly increase the stability and performance of...

متن کامل

Wised Semi-Supervised Cluster Ensemble Selection: A New Framework for Selecting and Combing Multiple Partitions Based on Prior knowledge

The Wisdom of Crowds, an innovative theory described in social science, claims that the aggregate decisions made by a group will often be better than those of its individual members if the four fundamental criteria of this theory are satisfied. This theory used for in clustering problems. Previous researches showed that this theory can significantly increase the stability and performance of...

متن کامل

SERAPH: Semi-supervised Metric Learning Paradigm with Hyper Sparsity

We consider the problem of learning a distance metric from a limited amount of pairwise information as effectively as possible. The proposed SERAPH (SEmi-supervised metRic leArning Paradigm with Hyper sparsity) is a direct and substantially more natural approach for semi-supervised metric learning, since the supervised and unsupervised parts are based on a unified information theoretic framewor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013